Using eSkel to Implement the Multiple Baseline Stereo Application
نویسندگان
چکیده
We give an overview of the Edinburgh Skeleton Library eSkel, a structured parallel programming library which offers a range of skeletal parallel programming constructs to the C/MPI programmer. Then we illustrate the efficacy of such a high level approach through an application of multiple baseline stereo. We describe the application and show different ways to introduce parallelism using algorithmic skeletons. Some performance results will be reported.
منابع مشابه
On the Abstraction of Message-Passing Communications Using Algorithmic Skeletons
This is an initial case on exploring the application of algorithmic skeletons to abstract low-level interprocess communication in MPI. The main purpose is intended to illustrate the competitive performance demonstrated by the skeletal approach when compared to utilization of the pure MPI, whilst providing an abstraction with reusability advantages. This initial work involves the implementation ...
متن کاملGeneration of Multiple Depth Images from a Single Depth Map Using Multi-baseline Information
In this paper, we propose an algorithm for generation of multiple depth images from one depth map using multi-baseline information. Although depth information is essential in three-dimensional (3-D) applications, the depth estimation from stereo matching is still time consuming and inaccurate. Since the real-time application like free viewpoint TV (FTV) require multiple depth information, stere...
متن کاملComponent-based Grid Programming A Case Study on Wavelets
Grid middleware allows linking heterogeneous servers to internet-spanning computational grids. Component architectures can abstract over many technical arrangements and provide a higher-level interface to middleware. Thus, “Higher-order components” (HOCs) require from the developer to provide only application level code, and low level aspects are transparent to the developer. Similarly, high le...
متن کاملOptimizing Disparity Candidates Space in Dense Stereo Matching
In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...
متن کاملBringing skeletons out of the closet: a pragmatic manifesto for skeletal parallel programming
Skeleton and pattern based parallel programming promise significant benefits but remain absent from mainstream practice. We consider why this situation has arisen and propose a number of design principles which may help to redress it. We sketch the eSkel library, which represents a concrete attempt to apply these principles. eSkel is based on C and MPI, thereby embedding its skeletons in a conc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005